首页> 外文OA文献 >Meta-heuristic algorithms for optimized network flow wavelet-based image coding
【2h】

Meta-heuristic algorithms for optimized network flow wavelet-based image coding

机译:基于启发式算法的优化网络小波图像编码

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Optimal multipath selection to maximize the received multiple description coding (MDCs) in a lossy network model is proposed. Multiple description scalar quantization (MDSQ) has been applied to the wavelet coefficients of a color image to generate the MDCs which are combating transmission loss over lossy networks. In the networks, each received description raises the reconstruction quality of an MDC-coded signal (image, audio or video). In terms of maximizing the received descriptions, a greater number of optimal routings between source and destination must be obtained. The rainbow network flow (RNF) collaborated with effective meta-heuristic algorithms is a good approach to resolve it. Two meta-heuristic algorithms which are genetic algorithm (GA) and particle swarm optimization (PSO) have been utilized to solve the multi-objective optimization routing problem for finding optimal routings each of which is assigned as a distinct color by RNF to maximize the coded descriptions in a network model. By employing a local search based priority encoding method, each individual in GA and particle in PSO is represented as a potential solution. The proposed algorithms are compared with the multipath Dijkstra algorithm (MDA) for both finding optimal paths and providing reliable multimedia communication. The simulations run over various random network topologies and the results show that the PSO algorithm finds optimal routings effectively and maximizes the received MDCs with assistance of RNF, leading to reduce packet loss and increase throughput.
机译:提出了在有损网络模型中最大化接收多描述编码(MDC)的最佳多径选择。多描述标量量化(MDSQ)已应用于彩色图像的小波系数,以生成MDC,以对抗有损网络上的传输损耗。在网络中,每个接收到的描述都提高了MDC编码信号(图像,音频或视频)的重建质量。就最大化所接收的描述而言,必须获得源与目的地之间的大量最佳路由。彩虹网络流(RNF)与有效的元启发式算法配合使用是解决该问题的好方法。遗传算法(GA)和粒子群优化(PSO)的两种元启发式算法已被用于解决多目标优化路由问题,以找到最优路由,每个最优路由都被RNF分配为不同的颜色,以最大化编码网络模型中的描述。通过采用基于本地搜索的优先级编码方法,将GA中的每个个体和PSO中的每个粒子表示为一个潜在的解决方案。将所提出的算法与多径Dijkstra算法(MDA)进行比较,以找到最佳路径并提供可靠的多媒体通信。仿真在各种随机网络拓扑上进行,结果表明,PSO算法可以有效地找到最佳路由,并借助RNF最大化接收到的MDC,从而减少数据包丢失并提高吞吐量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号